Regularity is Decidable for Normed PA Processes in Polynomial Time
نویسنده
چکیده
A process ∆ is regular if it is bisimilar to a process ∆′ with finitely many states. We prove that regularity of normed PA processes is decidable and we present a practically usable polynomial-time algorithm. Moreover, if the tested normed PA process ∆ is regular then the process ∆′ can be effectively constructed. It implies decidability of bisimulation equivalence for any pair of processes such that one process of this pair is a normed PA process and the other process has finitely many states.
منابع مشابه
Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time
We consider the problem of deciding regularity of normed BPP and normed BPA processes. A process is regular if it is bisimilar to a process with finitely many states. We show that regularity of normed BPP and normed BPA processes is decidable in polynomial time and we present constructive regularity tests. Combining these two results we obtain a rich subclass of normed PA processes (called sPA)...
متن کاملWeak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
We prove that weak bisimilarity is decidable in polynomial time between nite-state systems and several classes of innnite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the rst polynomial algorithms for weak bisimilarity problems involving innnite-state systems.
متن کاملA Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free Processes
A polynomial-time procedure is presented for deciding bisimilarity of normed context-free processes. It follows as a corollary that language equivalence of simple context-free grammars is decidable in polynomial time.
متن کاملOn the Complexity of Deciding Behavioural Equivalences and Preorders A Survey
This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinite-state BPA [BK84b] processes. A distinction, which turns out to be important in the finite-state processes, is that of simulation-like eq...
متن کاملSimulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate on...
متن کامل